Algebraic grid generation on trimmed parametric surface using non-self-overlapping planar Coons patch
نویسندگان
چکیده
Using a Coons patch mapping to generate a structured grid in the parametric region of a trimmed surface can avoid the singularity of elliptic PDE methods when only C1 continuous boundary is given; the error of converting generic parametric C1 boundary curves into a specified representation form is also avoided. However, overlap may happen on some portions of the algebraically generated grid when a linear or naïve cubic blending function is used in the mapping; this severely limits its usage in most of engineering and scientific applications where a grid system of non-self-overlapping is strictly required. To solve the problem, non-trivial blending functions in a Coons patch mapping should be determined adaptively by the given boundary so that self-overlapping can be averted. We address the adaptive determination problem by a functional optimization method. The governing equation of the optimization is derived by adding a virtual dimension in the parametric space of the given trimmed surface. Both oneand two-parameter blending functions are studied. To resolve the difficulty of guessing good initial blending functions for the conjugate gradient method used, a progressive optimization algorithm is then proposed which has been shown to be very effective in a variety of practical examples. Also, an extension is added to the objective function to control the element shape. Finally, experiment results are shown to illustrate the usefulness and effectiveness of the presented method. Copyright 2004 John Wiley & Sons, Ltd.
منابع مشابه
Interpolating and meshing 3D surface grids
In the boundary representation (B-Rep) model, a three-dimensional (3D) surface is de ned by a set of ‘simpler surfaces’ called ‘patches’. Although there are many di erent ways to specify a patch, a common case is that of a 4-sided patch represented by a structured grid of points. For instance, this kind of data can easily be obtained from a CAD system, as it is the mapping of regularly spaced p...
متن کاملStructured Grid Generation over NURBS and Facetted Surface Patches by Reparametrization
This paper deals with structured grid generation using Floater’s parametrization algorithm for surface triangulation. It gives an outline of the algorithm in the context of structured grid generation. Then it explains how the algorithm can be used to generate a structured grid over a singular NURBS surface patch. This is an alternate method to the known carpeting method of reparametrization for...
متن کاملApproximate development of trimmed patches for surface tessellation
This paper presents a method to construct an auxiliary planar domain of triangulation for tessellating trimmed parametric surface patches. By minimizing a mapping error function, an approximate locally isometric mapping between a given trimmed parametric surface patch and its triangulation domain is constructed. In this way the shape of triangular elements on the triangulation domain is approxi...
متن کاملNurbs Approximation of A-Splines and A-Patches
Given A spline curves and A patch surfaces that are implicitly de ned on triangles and tetrahedra we determine their NURBS representations We provide a trimmed NURBS form for A spline curves and a parametric tensor product NURBS form for A patch surfaces We concentrate on cubic A patches providing a C continuous surface that interpolates a given triangulation together with surface normals at th...
متن کاملGenerating strictly non-self-overlapping structured quadrilateral grids
In this paper, we present a BPM (Bézier Patch Mapping) algorithm which generates a strictly non-self-overlapping structured quadrilateral grid in a given four-sided planar region. Given four pieces of polynomial curves which enclose a simple region in the plane, the algorithm first constructs a Bézier patch which interpolates the four curves (as its four boundary curves), while the inner contro...
متن کامل